6 found
Order:
  1. Maximality in finite-valued Lukasiewicz logics defined by order filters.Marcelo E. Coniglio, Francesc Esteva, Joan Gispert & Lluis Godo - 2019 - Journal of Logic and Computation 29 (1):125-156.
    In this paper we consider the logics L(i,n) obtained from the (n+1)-valued Lukasiewicz logics L(n+1) by taking the order filter generated by i/n as the set of designated elements. In particular, the conditions of maximality and strong maximality among them are analyzed. We present a very general theorem that provides sufficient conditions for maximality between logics. As a consequence of this theorem, it is shown that L(i,n) is maximal w.r.t. CPL whenever n is prime. Concerning strong maximality (i.e. maximality w.r.t. (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  2. Modal logic with non-deterministic semantics: Part I—Propositional case.Marcelo E. Coniglio, Luis Fariñas del Cerro & Newton Peron - 2020 - Logic Journal of the IGPL 28 (3):281-315.
    Dugundji proved in 1940 that most parts of standard modal systems cannot be characterized by a single finite deterministic matrix. In the eighties, Ivlev proposed a semantics of four-valued non-deterministic matrices (which he called quasi-matrices), in order to characterize a hierarchy of weak modal logics without the necessitation rule. In a previous paper, we extended some systems of Ivlev’s hierarchy, also proposing weaker six-valued systems in which the (T) axiom was replaced by the deontic (D) axiom. In this paper, we (...)
    Download  
     
    Export citation  
     
    Bookmark  
  3. A model-theoretic analysis of Fidel-structures for mbC.Marcelo E. Coniglio - 2019 - In Can Başkent & Thomas Macaulay Ferguson (eds.), Graham Priest on Dialetheism and Paraconsistency. Cham, Switzerland: Springer Verlag. pp. 189-216.
    In this paper the class of Fidel-structures for the paraconsistent logic mbC is studied from the point of view of Model Theory and Category Theory. The basic point is that Fidel-structures for mbC (or mbC-structures) can be seen as first-order structures over the signature of Boolean algebras expanded by two binary predicate symbols N (for negation) and O (for the consistency connective) satisfying certain Horn sentences. This perspective allows us to consider notions and results from Model Theory in order to (...)
    Download  
     
    Export citation  
     
    Bookmark  
  4. Modal logic S4 as a paraconsistent logic with a topological semantics.Marcelo E. Coniglio & Leonardo Prieto-Sanabria - 2017 - In Caleiro Carlos, Dionisio Francisco, Gouveia Paula, Mateus Paulo & Rasga João (eds.), Logic and Computation: Essays in Honour of Amilcar Sernadas. College Publications. pp. 171-196.
    In this paper the propositional logic LTop is introduced, as an extension of classical propositional logic by adding a paraconsistent negation. This logic has a very natural interpretation in terms of topological models. The logic LTop is nothing more than an alternative presentation of modal logic S4, but in the language of a paraconsistent logic. Moreover, LTop is a logic of formal inconsistency in which the consistency and inconsistency operators have a nice topological interpretation. This constitutes a new proof of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  5. G'3 as the logic of modal 3-valued Heyting algebras.Marcelo E. Coniglio, Aldo Figallo-Orellano, Alejandro Hernández-Tello & Miguel Perez-Gaspar - 2022 - IfCoLog Journal of Logics and Their Applications 9 (1):175-197.
    In 2001, W. Carnielli and Marcos considered a 3-valued logic in order to prove that the schema ϕ ∨ (ϕ → ψ) is not a theorem of da Costa’s logic Cω. In 2006, this logic was studied (and baptized) as G'3 by Osorio et al. as a tool to define semantics of logic programming. It is known that the truth-tables of G'3 have the same expressive power than the one of Łukasiewicz 3-valued logic as well as the one of Gödel (...)
    Download  
     
    Export citation  
     
    Bookmark  
  6. Paracomplete logics which are dual to the paraconsistent logics L3A and L3B.Alejandro Hernández-Tello, Verónica Borja-Macı́as & Marcelo E. Coniglio - 2020 - LANMR 2019: Proceedings of the 12th Latin American Workshop on Logic/Languages, Algorithms and New Methods of Reasoning.
    In 2016 Beziau, introduce a more restricted concept of paraconsistency, namely the genuine paraconsistency. He calls genuine paraconsistent logic those logic rejecting φ, ¬φ |- ψ and |- ¬(φ ∧ ¬φ). In that paper the author analyzes, among the three-valued logics, which of these logics satisfy this property. If we consider multiple-conclusion consequence relations, the dual properties of those above mentioned are: |- φ, ¬φ, and ¬(ψ ∨ ¬ψ) |- . We call genuine paracomplete logics those rejecting the mentioned properties. (...)
    Download  
     
    Export citation  
     
    Bookmark